Method for configuring a telecommunication system

ABSTRACT

The invention relates to a method for configuring a telecommunication system comprising at least one sending entity and one receiving entity between which the same link transmits several transport channels with different qualities of service. The sending entity matches the rate between the different coded transport channels with separate qualities of service, and the different coded transport channels are then multiplexed.  
     The matching rate specific to each coded transport channel is determined from at least one first parameter (RM i ) representative of the expected Eb/I ratio and a second parameter N data  representative of the capacity of the physical channel.  
     Application to a mobile telephony network.

[0001] This invention relates to a method for configuring atelecommunication system comprising at least one sending entity and atleast one receiving entity, said sending and receiving entitiesimplementing a step for transmission of data transported on at least onephysical channel, said at least one physical channel transmitting atransport channel composite under formation and having its own maximumphysical rate, said transport channel composite comprising at least “twotransport channels”, said data transmission step being preceded by adata processing procedure for each of said transport channels, said dataprocessing procedure comprising at least one rate matching step, saidrate matching step transforming a number of symbols before rate matchinginto a number of symbols after rate matching, said number of symbolsafter rate matching being obtained approximately by multiplying saidnumber of symbols before rate matching by a rate matching ratio specificto each of said at least two transport channels, said transport channelcomposite having a number of symbols approximately equal to thealgebraic sum of the numbers of symbols in the transport channels afterthe rate matching steps in said processing procedures for a periodcommon to said processing procedures.

[0002] The 3GPP (3^(rd) Generation Partnership Project) Committee is anorganization whose members originate from various regionalstandardization organizations and particularly the ETSI (EuropeanTelecommunication Standardization Institute) for Europe and the ARIB(Association of Radio Industries and Businesses) for Japan, and thepurpose of which is to standardize a 3^(rd) generation telecommunicationsystem for mobiles. The CDMA (Code Division Multiple Access) technologyhas been selected for these systems. One of the fundamental aspectsdistinguishing 3^(rd) generation systems from 2^(nd) generation systems,apart from the fact that they make more efficient use of the radiospectrum, is that they provide very flexible services. 2^(nd) generationsystems offer an optimized radio interface only for some services, forexample the GSM (Global System for Mobiles) system is optimized forvoice transmission (telephony service). 3^(rd) generation systems have aradio interface adapted to all types of services and servicecombinations.

[0003] Therefore, one of the benefits of 3^(rd) generation mobile radiosystems is that they can efficiently multiplex services that do not havethe same requirements in terms of Quality of Service (QoS), on the radiointerface. In particular, these quality of service differences implythat the channel encoding and channel interleaving should be differentfor each of the corresponding transport channels used, and that the biterror rates (BER) are different for each transport channel. The biterror rate for a given channel encoding is sufficiently small when theEb/I ratio, which depends on the coding, is sufficiently high for allcoded bits. Eb/I is the ratio between the average energy of each codedbit (Eb) and the average energy of the interference (I), and depends onthe encoding. The term symbol is used to denote an information elementthat can be equal to a finite number of values within an alphabet, forexample a symbol may be equivalent to a bit when it can only be one oftwo values.

[0004] The result is that since the various services do not have thesame quality of service, they do not have the same requirement in termsof the Eb/I ratio. But yet, in a CDMA type system, the capacity of thesystem is limited by the level of interference. Thus, an increase in theenergy of bits coded for a user (Eb) contributes to increasinginterference (I) for other users. Therefore, the Eb/I ratio has to befixed as accurately as possible for each service in order to limitinterference produced by this service. An operation to balance the Eb/Iratio between the different services is then necessary. If thisoperation is not carried out, the Eb/I ratio would be fixed by theservice with the highest requirement, and the result will be that thequality of the other services would be “too good”, which would have adirect impact on the system capacity in terms of the number of users.This causes a problem, since rate matching ratios are definedidentically at both ends of the radio link.

[0005] This invention relates to a method for configuring atelecommunication system to define rate matching ratios identically atboth ends of a CDMA type radio link.

[0006] In the ISO's (International Standardization Organization) OSI(Open System Interconnection) model, a telecommunication equipment ismodeled by a layered model comprising a stack of protocols in which eachlayer is a protocol that provides a service to the higher level layer.The 3GPP committee calls the service provided by the level 1 layer tothe level 2 layer “transport channels”. A transport channel (TrCH forshort) enables the higher level layer to transmit data with a givenquality of service. The quality of service is characterized inparticular by a processing delay, a bit error rate and an error rate perblock. A transport channel may be understood as a data flow at theinterface between the level 1 layer and the level 2 layer in the sametelecommunication equipment. A transport channel may also be understoodas a data flow between the two level 2 layers in a mobile station and ina telecommunication network entity connected to each other through aradio link. Thus, the level 1 layer uses suitable channel encoding andchannel interleaving, in order to satisfy the quality of servicerequirement.

[0007] Solutions proposed by the 3GPP committee to achieve thisbalancing are illustrated in FIGS. 1 and 2. FIG. 1 is a diagrammaticview illustrating multiplexing of transport channels on the downlinkaccording to the current proposal of the 3GPP committee. In the currentproposal of this committee, the symbols processed until the last step130 described below are bits.

[0008] With reference to FIG. 1, a higher level layer 101 periodicallysupplies transport block sets to the level 1 layer. These sets aresupplied in transport channels reference 100. A periodic time intervalwith which the transport block set is supplied to the transport channelis called the Transmission Time Interval (TTI) of the transport channel.Each transport channel has its own TTI time interval which may be equalto 10, 20, 40 or 80 ms. FIG. 2 shows examples of transport channels A,B, C and D. In this figure, the transport block set received by eachtransport channel is represented by a bar in the histogram. The lengthof the bar in the histogram represents a TTI interval of the associatedtransport channel and its area corresponds to the useful load in thetransport block set. With reference to FIG. 2, the duration of the TTIintervals associated with transport channels A, B, C and D is equal to80 ms, 40 ms, 20 ms and 10 ms respectively. Furthermore, the dottedhorizontal lines in the histogram bars indicate the number of transportblocks in each transport block set. In FIG. 2, transport channel Areceives a first transport block set A₀ comprising three transportblocks during a first transmission time interval, and a second transportblock set A₁ comprising a single transport block during the next TTIinterval. Similarly, transport channel B receives transport block setsB₀, B₁, B₂ and B₃ during four consecutive TTI intervals, comprising 0,2, 1 and 3 transport blocks respectively. Transport channel C receivestransport block sets C₀ to C₇ during eight successive TTI intervals andfinally transport channel D receives transport block sets D₀ to D₁₅during sixteen TTI intervals.

[0009] Note that a TTI interval for a given transport channel cannotoverlap two TTI intervals in another transport channel. This is possiblebecause TTI intervals increase geometrically (10 ms, 20 ms, 40 ms and 80ms). Note also that two transport channels with the same quality ofservice necessarily have the same TTI intervals. Furthermore, the term“transport format” is used to describe the information representing thenumber of transport blocks contained in the transport block set receivedby a transport channel and the size of each transport block. For a giventransport channel, there is a finite set of possible transport formats,one of which is selected at each TTI interval as a function of the needsof higher level layers. In the case of a constant rate transportchannel, this set only includes a single element. On the other hand, inthe case of a variable rate transport channel, this set comprisesseveral elements and therefore the transport format can vary from oneTTI interval to the other when the rate itself varies. In the exampleshown in FIG. 2, transport channel A has a first transport format forthe set A₀ received during radio frames 0 to 7, and a second transportformat for set A₁ during radio frames 8 to 15.

[0010] According to the assumptions currently made by the 3GPPcommittee, there are two types of transport channels, namely real timetransport channels and non-real time transport channels. No automaticrepeat request (ARQ) is used in the case of an error with real timetransport channels. The transport block set contains at most onetransport block and there is a limited number of possible sizes of thistransport block. The expressions “block size” and “number of symbols perblock” will be used indifferently in the rest of this description.

[0011] For example, the transport formats defined in the following tablemay be obtained: Transport Number of Corresponding format transporttransport index blocks block size 0 0 — 1 1 100 2 1 120

[0012] In this table, the minimum rate is zero bit per TTI interval.This rate is obtained for transport format 0. The maximum rate is 120bits per TTI interval and it is obtained for transport format 2.

[0013] Automatic repetition can be used in the case of an error withnon-real time transport channels. The transport block set contains avariable number of transport blocks of the same size. For example, thetransport formats defined in the following table may be obtained:Transport Number of format transport Transport index blocks block size 01 160 1 2 160 2 3 160

[0014] In this table, the minimum rate is 160 bits per TTI interval.This rate is obtained for transport format 0. The maximum rate is 480bits per TTI interval and is obtained transport format 2.

[0015] Thus considering the example shown in FIG. 2, the followingdescription is applicable for transport channels A, B, C and D:Transport A channel TTI 80 ms interval Transport formats TransportNumber of format transport Transport index blocks block size 0 1 160 1 2160 2 3 160

[0016] In FIG. 2, the transport block set A₀ is in transport format 2,whereas A₁ is in transport format 0. Transport B channel TTI 40 msinterval Transport formats Transport Number of format transportTransport index blocks block size 0 0 — 1 2 80 2 1 80 3 3 80

[0017] In FIG. 2, transport block sets B₀, B₁, B₂ and B₃ are intransport formats 0, 1, 2 and 3 respectively. Transport C channel TTI 20ms interval Transport formats Transport Number of format transportTransport index blocks block size 0 0 — 1 1 100 2 1 120

[0018] In FIG. 2, transport block sets C₀, C₁, C₂, C₃, C₄, C₅, C₆ and C₇are in transport formats 2, 2, 1, 2, 2, 0, 0 and 2 respectively.Transport D channel TTI 10 ms interval Transport formats TransportNumber of format transport Transport index blocks block size 0 0 — 1 120 2 2 20 3 3 20

[0019] In FIG. 2, transport block sets D₀ to D₁₅ are in transportformats 1, 2, 2, 3, 1, 0, 1, 1, 1, 2, 2, 0, 0, 1, 1 and 1 respectively.

[0020] For each radio frame, a transport format combination (TFC) canthen be formed starting from the current transport formats for eachtransport channel. With reference to FIG. 2, the transport formatcombination for frame 0 is ((A,2), (B,0), (C,2), (D, 1)). It indicatesthat transport formats for transport channels A, B, C and D for frame 0are 2, 0, 2, and 1 respectively. Index 5 is associated with thistransport format combination in the following table that illustrates apossible set of transport format combinations to describe the example inFIG. 2: Frame Transport format for transport number with CombinationChannels this index A B C D combination  0 0 2 0 0 11  1 0 2 0 2 10  2 03 0 0 12  3 0 3 0 1 13  4 0 2 2 1  8  5 2 0 2 1  0  6 0 2 2 2  9  7 2 11 0  5  8 2 0 2 2 1 and 2  9 0 3 2 1 14 and 15 10 2 1 1 1  4 11 2 0 2 3 3 12 2 1 2 1 6 and 7

[0021] Therefore, with reference once again to FIG. 1, each transportchannel reference 100 receives a transport block set at each associatedTTI interval originating from a higher level layer 101. Transportchannels with the same quality of service are processed by the sameprocessing system 102A, 102B. A frame checking sequence (FCS) isassigned to each of these blocks during a step 104. These sequences areused in reception to detect whether or not the received transport blockis correct. The next step, reference 106, consists of multiplexing thevarious transport channels with the same quality of service (QoS) witheach other. Since these transport channels have the same quality ofservice, they can be coded in the same way. Typically, this multiplexingoperation consists of an operation in which transport block sets areconcatenated. The next step consists of carrying out a channel encodingoperation, 108, on multiplexed sets of blocks. The result at the end ofthis step is a set of coded transport blocks. A coded block maycorrespond to several transport blocks. In the same way as a sequence oftransport block sets forms a transport channel, a sequence of sets ofcoded transport blocks is called a coded transport channel. Channelscoded in this way are then rate matched in a step 118 and are theninterleaved on their associated TTI intervals in a step 120 and are thensegmented in a step 122. During the segmentation step 122, the codedtransport block sets are segmented such that there is one data segmentfor each multiplexing frame in a TTI interval in the channel concerned.A multiplexing frame is the smallest time interval for which ademultiplexing operation can be operated in reception. In our case, amultiplexing frame corresponds to a radio frame and lasts for 10 ms.

[0022] As already mentioned, the purpose of the rate matching step (118)is to balance the Eb/I ratio on reception between transport channelswith different qualities of service. The bit error rate BER on receptiondepends on this ratio. In a system using the CDMA multiple accesstechnology, the quality of service that can be obtained is greater whenthis ratio is greater. Therefore, it is understandable that transportchannels with different qualities of service do not have the same needsin terms of the Eb/I ratio, and that if the rate is not matched, thequality of some transport channels would be “too” good since it is fixedby the most demanding channel and would unnecessarily cause interferenceon adjacent transport channels. Therefore, matching the rate alsobalances the Eb/I ratio. The rate is matched such that N input symbolsgive N+ΔN output symbols, which multiplies the Eb/I ratio by the$\frac{N + {\Delta \quad N}}{N}$

[0023] ratio. This $\frac{N + {\Delta \quad N}}{N}$

[0024] ratio is equal to the rate matching ratio RF, except forrounding.

[0025] In the downlink, the peak/average ratio of the radio frequencypower is not very good, since the network transmits to several users atthe same time. Signals sent to these users are combined constructivelyor destructively, thus inducing large variations in the radio frequencypower emitted by the network, and therefore a bad peak/average ratio.Therefore, for the downlink it was decided that the Eb/I ratio will bebalanced between the various transport channels by rate matching using asemi-static rate matching ratio${{RF} \approx \frac{N + {\Delta \quad N}}{N}},$

[0026] and that multiplexing frames would be padded by dummy symbols, inother words non-transmitted symbols (discontinuous transmission). Dummysymbols are also denoted by the abbreviation DTX (DiscontinuousTransmission). Semi-static means that this RF ratio can only be modifiedby a specific transaction implemented by a protocol from a higher levellayer. The number of DTX symbols to be inserted is chosen such that themultiplexing frame padded with DTX symbols completely fills in theDedicated Physical Data Channel(s) (DPDCH).

[0027] This discontinuous transmission degrades the peak/average ratioof the radio frequency power, but this degradation is tolerableconsidering the simplified construction of the receiving mobile stationobtained with a semi-static rate matching ratio.

[0028] Referring once again to FIG. 1, the transport channels withdifferent qualities of service after encoding, segmentation,interleaving and rate matching are multiplexed to each other in a step124 in order to prepare multiplexing frames forming a transport channelcomposite. This multiplexing is done for each multiplexing frameindividually. Since the rate of the multiplexed transport channels maybe variable, the composite rate obtained at the end of this step is alsovariable. The capacity of a physical channel referred to as a DPDCH(Dedicated Physical Data Channel) is limited, consequently it ispossible that the number of physical channels necessary to transportthis composite may be greater than one. When the required number ofphysical channels is greater than one, a segmentation step 126 for thiscomposite is included. For example, in the case of two physicalchannels, this segmentation step 126 may consist of alternately sendingone symbol to the first of the two physical channels denoted DPDCH#1,and a symbol to the second physical channel denoted DPDCH#2.

[0029] The data segments obtained are then interleaved in a step 128 andare then transmitted on the physical channel in a step 130. This finalstep 130 consists of modulating the symbols transmitted by spectrumspreading.

[0030] DTX symbols are dynamically inserted either for each TTI intervalseparately in a step 116, or for each multiplexing frame separately in astep 132. The rate matching ratios RF_(i) associated with each transportchannel i are determined such as to minimize the number of DTX symbolsto be inserted when the total transport channel composite rate after themultiplexing step 124 is maximum. The purpose of this technique is tolimit degradation of the peak/average ratio of the radio frequency powerin the worst case.

[0031] The rate is matched by puncturing (RF_(i)<1, ΔN <0) or byrepetition (RF_(i)>1, ΔN >0). Puncturing consists of deleting −ΔNsymbols, which is tolerable since they are channel encoded symbols, andtherefore despite this operation, when the rate matching ratio RF_(i) isnot too low, channel decoding in reception (which is the inverseoperation of channel encoding) can reproduce data transported by thetransport channels without any error (typically when RF_(i)≧0.8, inother words when not more than 20% of symbols are punctured).

[0032] DTX symbols are inserted during one of the two mutually exclusivetechniques. They are inserted either in step 116 using the “fixedservice positions” technique, or in step 132 using the “flexible servicepositions” technique. Fixed service positions are used since they enableto carry out a blind rate detection with acceptable complexity. Flexibleservice positions are used when there is no blind rate detection. Notethat the DTX symbols insertion step 116 is optional.

[0033] During step 116 (fixed service positions), the number of DTXsymbols inserted is sufficient so that the data flow rate after thisstep 116 is constant regardless of the transport format of the transportchannels before this step 116. In this way, the transport format of thetransport channels may be detected blind with reduced complexity, inother words without transmitting an explicit indication of the currenttransport format combination on an associated dedicated physical controlchannel (DPCCH). Blind detection consists of testing all transportformats until the right encoding format is detected, particularly usingthe frame checking sequence FCS.

[0034] If the rate is detected using an explicit indication, the DTXsymbols are preferably inserted in step 132 (flexible servicepositions). This makes it possible to insert a smaller number of DTXsymbols when the rates on two composite transport channels are notindependent, and particularly in the case in which they arecomplementary since the two transport channels are then never at theirmaximum rate simultaneously.

[0035] At the present time, the only algorithms that are being definedare the multiplexing, channel encoding, interleaving and rate matchingalgorithms. A rule needs to be defined to fix a relation in the downlinkbetween the number N of symbols before rate matching and the variationΔN corresponding to the difference between the number of symbols beforerate matching and the number of symbols after rate matching.

[0036] Consider the example shown in FIG. 2. Transport channel B acceptsfour transport formats indexed from 0 to 3. Assume that the codedtransport channel originating from transport channel B produces not morethan one coded block for each transport format, as shown in thefollowing table. Transport B channel TTI 40 ms interval Transportformats Transport Number of Transport Number of Coded format transportblock coded block index blocks size blocks size (N) 0 0 — 0 — 1 2 80 1368 2 1 80 1 192 3 3 80 1 544

[0037] Assume that RF_(B)=1.3333 is the rate matching ratio, then thevariation ΔN generated by rate matching varies with each transportformat, for example as in the following table: Transport B channel TTI40 ms interval Transport formats Transport Number of Coded format codedblock Variation index blocks size (N) (ΔN) 0 0 — — 1 1 368 123 2 1 192 64 3 1 544 181

[0038] Thus, the existence of this type of rule to calculate thevariation ΔN as a function of the number N of symbols before ratematching could simplify negotiation of the connection. Thus, accordingto the example in the above table, instead of providing three possiblevariations ΔN, it would be sufficient to supply a restricted number ofparameters to the other end of the link that could be used to calculatethem. An additional advantage is that the quantity of information to besupplied when adding, releasing or modifying the rate matching of atransport channel, is very small since parameters related to othertransport channels remain unchanged.

[0039] A calculation rule was already proposed during meeting No. 6 ofthe work sub-group WG1 of sub-group 3GPP/TSG/RAN of the 3GPP committeein Jul. 1999 in Espoo (Finland). This rule is described in section4.2.6.2 of the proposed text presented in document3GPP/TSG/RAN/WG1/TSGR1#6(99)997 “Text Proposal for rate matchingsignaling”. However, it introduces a number of problems as we willdemonstrate. Note the notation used in this presentation is not exactlythe same as the notation in document TSGR1#6(99)997 mentioned above.

[0040] In order to clarify the presentation, we will start by describingthe notation used in the rest of the description.

[0041] Let i denote the index representing the successive values 1, 2, .. . , T of the coded transport channels, then the set of indexes of thetransport formats of the coded transport channel i are denoted TFS(i),for all values of i ε {1, . . . , T}. If j is the index of a transportformat of a coded transport channel i, in other words j ε TFS (i), theset of indexes of coded blocks originating from the coded transportchannel i for transport format j is denoted CBS(i,j). Each coded blockindex is assigned uniquely to a coded block, for all transport formatsand all coded transport channels. In summary we have: $\begin{matrix}\left\{ {\left. {{\begin{matrix}{\forall{i \in \left\{ {1,\ldots \quad,T} \right\}}} \\{\forall{j \in {{TFS}(i)}}} \\{\forall{i^{\prime} \in \left\{ {1,\ldots \quad,T} \right\}}} \\{\forall{j^{\prime} \in {{TFS}\left( i^{\prime} \right)}}}\end{matrix}\quad \left( {i,j} \right)} \neq \left( {i^{\prime},j^{\prime}} \right)}\Rightarrow{{{CBS}\left( {i,j} \right)}\bigcap{{CBS}\left( {i^{\prime},j^{\prime}} \right)}} \right. = \varnothing} \right. & (1)\end{matrix}$

[0042] where Ø is an empty set. Note that for the purposes of thispresentation, the index of a coded block does not depend on the datacontained in this block, but it identifies the coded transport channelthat produced this coded block, the transport format of this channel,and the block itself if this transport channel produces several codedblocks for this transport format. This block index is also called thecoded block type. Typically, coded transport channel i does not producemore than 1 coded block for a given transport format j, and thereforeCBS(i,j) is either an empty set or a singleton. If a coded transportchannel i produces n coded blocks for transport format j, then CBS(i,j)comprises n elements.

[0043] We will also use TFCS to denote the set of transport formatcombinations. Each element in this set may be bi-univocally representedby a list of (i,j) pairs associating each coded transport channelindexed i in {1, . . . , T} with a transport format with index j in thiscoded transport channel (j ε TFS(i)). In other words, a transport formatcombination can determine a transport format j corresponding to eachcoded transport channel i. In the rest of this presentation, it isassumed that the set TFCS comprises C elements, the transport formatcombinations for this set then being indexed from 1 to C. If l is theindex of a transport format combination, then the transport format indexcorresponding to the coded transport channel indexed i in the transportformat combination with index l will be denoted TF_(i) (l). In otherwords, the transport format combination with index l is represented bythe following list:

((l,TF_(l)(l)), (2,TF₂(l)), . . . , (T,TF_(T)(l)))

[0044] The set of block size indexes for any transport formatcombination l is denoted MSB(l). Therefore, we have: $\begin{matrix}{{\forall{l \in {\left\{ {1,\ldots \quad,C} \right\} {{MSB}(l)}}}} = {\bigcup\limits_{1 \leq l \leq T}{{CBS}\left( {i,{{TF}_{i}(l)}} \right)}}} & (2)\end{matrix}$

[0045] Furthermore, the number of multiplexing frames in eachtransmission time interval on the coded transport channel i is denotedF_(i). Thus, in the sending system shown in FIG. 1, any blockoriginating from the coded transport channel i is segmented into F_(i)blocks or segments. Based on the current assumptions made by the 3GPPcommittee, the sizes of these blocks are approximately equal. Forexample, if F_(i)=4 and the block on which segmentation step 122 isapplied comprises 100 symbols, then the segments obtained at the end ofthis step 122 comprise 25 symbols. On the other hand, if the segmentedblock comprises only 99 symbols, since 99 is not a multiple of 4, thenafter segmentation there will be either 3 blocks of 25 symbols with 1block of 24 symbols, or 4 blocks of 25 symbols with a padding symbolbeing added during the segmentation step 122. However, if X is thenumber of symbols in the block before segmentation step 122, it can bewritten that $\left\lceil \frac{X}{F_{i}} \right\rceil$

[0046] is the maximum number of symbols per segment, the notation ┌x┐denoting the smallest integer greater than or equal to x.

[0047] Finally, for a coded block with type or index k, the number ofsymbols in this coded block before rate matching is denoted N_(k), andthe variation between the number of symbols after rate matching and thenumber of symbols before rate matching is denoted ΔN_(k). Furthermore,note that in the rest of this text, the expressions “rate” and “numberof symbols per multiplexing frame” are used indifferently. For amultiplexing frame with a given duration, the number of symbolsexpresses a rate as a number of symbols per multiplexing frame interval.

[0048] Now that the notation has been defined, we can describe thecalculation rule described in document 3GPP/TSG/RAN/WG1/TSGR1#6(99)997“Text proposal for rate matching signaling”.

[0049] A prerequisite for this rule is to determine a transport formatcombination l₀ for which the composite rate is maximum. For thistransport format combination l₀, the variations ΔN_(k) ^(MF) for blockswith N_(k) ^(MF) symbols before rate matching will be determined. Thisis done only for transport format combination l₀, in other words onlyfor all values k ε MBS(l₀). The upper index MF in the ΔN_(k) ^(MF) andN_(k) ^(MF) notations means that these parameters are calculated for amultiplexing frame and not for a TTI interval. By definition:$\begin{matrix}\left\{ {{\begin{matrix}{\forall{i \in \left\{ {{1,\ldots \quad,T}} \right\}}} \\{\forall{j \in {{TFS}(i)}}} \\{\forall{k \in {{CBS}\left( {i,j} \right)}}}\end{matrix}\quad N_{k}^{MF}} = \left\lceil \frac{N_{k}}{F_{i}} \right\rceil} \right. & (3)\end{matrix}$

[0050] The next step is to proceed as if the rate matching 118 wascarried out after segmentation per multiplexing frame step 122 to definethe variations ΔN_(k) ^(MF). For flexible service positions, thevariations ΔN_(k) ^(MF) for k ∉ MBS(l₀) are calculated using thefollowing equation: $\begin{matrix}\left\{ {{\begin{matrix}{\forall{l \in \left\{ {1,\ldots \quad,C} \right\}}} \\{\forall{k \in {{{MSB}(l)}\quad {and}\quad k} \notin {{MSB}\left( l_{0} \right)}}}\end{matrix}\quad \Delta \quad N_{k}^{MF}} = \left\lfloor {\frac{\Delta \quad N_{K{(k)}}^{MF}}{N_{K{(k)}}^{MF}} \cdot N_{k}^{MF}} \right\rfloor} \right. & (4)\end{matrix}$

[0051] where, for any coded block with index k, κ(k) is the element ofMSB(l₀) such that coded blocks with index k and κ(k) originate from thesame coded transport channel and where └x┘ denotes the largest integerless than or equal to x.

[0052] For fixed service positions, the variations ΔN_(k) ^(MF) for k ∉MSB(l₀) are calculated using the following equation: $\begin{matrix}\left\{ {{\begin{matrix}{\forall{l \in \left\{ {1,\ldots \quad,C} \right\}}} \\{\forall{k \in {{{MSB}(l)}\quad {and}\quad k} \notin {{MSB}\left( l_{0} \right)}}}\end{matrix}\quad \Delta \quad N_{k}^{MF}} = {\Delta \quad N_{K{(k)}}^{MF}}} \right. & \text{(4bis)}\end{matrix}$

[0053] Note that the definition of κ(k) does not create any problem withthis method since, for any value of (i,j), CBS(i,j) comprises a singleelement and therefore if i is the index of the coded transport channelthat produces the coded block with indexed size k, then κ(k) is definedas being the single element of CBS(i,l₀).

[0054] With this rule, it is guaranteed that CBS(i,j) is a singletonsince, firstly the number of coded blocks per TTI interval is not morethan one (basic assumption), and secondly when this number is zero it isconsidered that the block size is zero and CBS(i,j) then contains asingle element k with N_(k)=0.

[0055] Finally, the set of variations ΔN_(k) is calculated using thefollowing equation: $\left\{ {{\begin{matrix}{\forall{i \in \left\{ {{1,\ldots \quad,T}} \right\}}} \\{\forall{j \in {{TFS}(i)}}} \\{\forall{k \in {{CBS}\left( {i,j} \right)}}}\end{matrix}\quad \Delta \quad N_{k}} = {{F_{i} \cdot \Delta}\quad N_{k}^{MF}}} \right.$

[0056] which, in terms of variation, corresponds to the inverseoperation of equation (3), by reducing the considered multiplexing frameperiod to a TTI interval.

[0057] The following problems arise with this calculation rule:

[0058] 1) nothing is written to say what is meant by the composite rate(the exact rate can only be determined when the variations ΔN have beencalculated; therefore, it cannot be used in the calculation rule);

[0059] 2) even if this concept were defined, it is probable that thereare some cases in which the transport format combination that gives themaximum composite rate is not unique; the result is that the definitionof the combination l₀ is incomplete;

[0060] 3) equation (4) introduces a major problem. The transport formatcombination for which the composite rate is maximum is not necessarilysuch that all transport channels are simultaneously at their maximumrates. In the following, the number of symbols available permultiplexing frame for the CCTrCH composite will be called the maximumphysical rate N_(data). The maximum physical rate depends on theresources in allocated physical channels DPDCH. Therefore, it ispossible that the maximum physical rate N_(data) of the physicalchannel(s) carrying the composite is insufficient for all transportchannels to be at their maximum respective rates simultaneously.Therefore in this case, there is no transport format combination inwhich all transport channels are at their maximum rates simultaneously.Thus, transport channel rates are not independent of each other. Sometransport channels have a lower priority than others such that when themaximum physical rate N_(data) is insufficient, only the highestpriority transport channels are able to transmit, and transmission forthe others is delayed. Typically, this type of arbitration is carriedout in the medium access control (MAC) sub-level of the level 2 layer inthe OSI model. Since transport channels are not necessarily at theirmaximum rates simultaneously when the composite is at its maximum ratein transport format combination l₀, in particular it is possible thatone of them is at zero rate; therefore, it is possible to find a valuek₀ ε MBS(l₀) such that N_(k) ₀ ^(MF)=0, and consequently ΔN_(k) ₀^(MF)=0. If k₁ ∉MBS(l₀) is such that k₀=κ(k₁), equation (4) then becomesas follows for k=k₁:${\Delta \quad N_{k_{1}}^{MF}} = {\left\lfloor {\frac{\Delta \quad N_{k_{0}}^{MF}}{N_{k_{0}}^{MF}} \cdot N_{k_{1}}^{MF}} \right\rfloor = \left\lfloor {\frac{0}{0} \cdot N_{k_{1}}^{MF}} \right\rfloor}$

[0061] It then includes $\frac{0}{0}$

[0062] type of indeterminate value. In the same way, it is possible thatN_(k) ₀ ^(MF) is very small compared with N_(k) ₁ ^(MF), even if it isnot 0. Thus, whereas the composite is in the transport formatcombination l₀ at its maximum rate, the transport channel correspondingto coded block indexes k₀ and k₁ is at a very low rate N_(k) ₀ ^(MF)compared with another possible rate N_(k) ₁ ^(MF) for the same transportchannel. The result is that equation (4) giving ΔN_(k) ₁ ^(MF) as afunction of ΔN_(k) ₀ ^(MF) amplifies the rounding error made duringdetermination of ΔN_(k) ₀ ^(MF) by a factor$\frac{N_{k_{1}}^{MF}}{N_{k_{0}}^{MF}}$

[0063] which is very large compared with one. However, suchamplification of the rounding error in this way is not desirable.

[0064] One purpose of the invention is to suggest a rule for overcomingthe disadvantages described above.

[0065] Another purpose of the invention is to provide this type ofmethod that can define rate matching for the downlink for all possiblesituations, and particularly for at least one of the following cases:

[0066] when ΔN_(k) ₀ ^(MF) and N_(k) ₀ ^(MF) are zero simultaneously;

[0067] the $\frac{N_{k_{1}}^{MF}}{N_{k_{0}}^{MF}}$

[0068]  ratio is very large compared with 1;

[0069] the rate of at least some transport channels of a transportchannel composite depends on at least some other transport channels inthe same transport channel composite.

[0070] Another purpose of the invention is to provide a method forminimizing the number of dummy symbols (DTX) to be inserted when therate of the coded transport channel composite is maximum.

[0071] Consequently, the subject of the invention is a method forconfiguring a telecommunication system comprising at least one sendingentity and at least one receiving entity, said sending and receivingentities implementing a step for transmission of data transported on atleast one physical channel, said at least one physical channeltransmitting a transport channel composite under formation and havingits own maximum physical rate offered by said at least one physicalchannel, said transport channel composite comprising at least twotransport channels, said data transmission step being preceded by a dataprocessing procedure for each of said transport channels, said dataprocessing procedure comprising at least one rate matching step, saidrate matching step transforming a number of symbols before said ratematching step into a number of symbols after said rate matching step,said number of symbols after said rate matching step being obtainedapproximately by multiplying said number of symbols before said ratematching step by a rate matching ratio specific to each of said at leasttwo transport channels, said transport channel composite having a numberof symbols approximately equal to the algebraic sum of the numbers ofsymbols in the transport channels after the corresponding rate matchingsteps in said processing procedures for a period common to saidprocessing procedures,

[0072] characterized in that it comprises the following successivesteps:

[0073] a step for determining, from at least one of said entities,

[0074] for each of said processing procedures, a first parameter relatedto the rate matching, said first parameter being proportional to saidrate matching ratio, and

[0075] for all said processing procedures, a second parameterrepresenting said maximum physical rate;

[0076] a transmission step for said first and second parametersdetermined from at least one of said entities, called the first entity,to another of said entities, called the second entity; and

[0077] a step in which at least said second entity determines thevariation between the number of symbols after said rate matching stepand the number of symbols before said rate matching step, for each ofsaid processing procedures, starting from one of said first and secondtransmitted parameters, such that the maximum rate of said transportchannel composite obtained does not cause an overshoot of said maximumphysical rate of said at least one physical channel.

[0078] Note that data blocks to which the rate matching step 118 isapplicable are the coded blocks originating from the channel encodingstep 108 (see FIG. 1).

[0079] According to one important characteristic of the invention, saidstep in which the variation between the number of symbols after saidrate matching step and the number of symbols before said rate matchingstep is determined starting from one of said first and secondtransmitted parameters includes at least some of the following steps:

[0080] a step in which a temporary variation is calculated for each ofsaid data block types starting from said first and second parameters andsaid number of symbols before said rate matching step;

[0081] a correction step of said temporary variations for all saidtransport format combinations, such that a temporary rate of thecomposite, said temporary rate resulting from said temporary variations,does not cause an overshoot of said maximum physical rate for the allsaid transport format combinations, said correction step being calledthe global correction step;

[0082] a step in which final variations are determined.

[0083] Another subject of the invention is a configuration apparatus ofthe type comprising at least means of transmitting data transported onat least one physical channel, said at least one physical channeltransmitting a transport channel composite under formation and with amaximum physical rate offered by said at least one physical channel,said transport channel composite comprising at least two transportchannels, said apparatus comprising a data processing module comprisingat least rate matching means for each of said transport channels, saidrate matching means transforming a number of input symbols to said ratematching means into a number of output symbols from said rate matchingmeans obtained approximately by multiplying said number of input symbolsby a rate matching ratio specific to said at least one transport channelconcerned, said transport channel composite having a number of symbolsapproximately equal to the algebraic sum of the numbers of transportchannel symbols originating from the corresponding rate matching meansin said processing modules for a period common to said processing,

[0084] characterized in that it comprises:

[0085] means of determining a first parameter related to the ratematching proportional to said rate matching ratio for each of saidprocessing modules, and a second parameter representative of saidmaximum physical rate for the set of said processing modules, from atleast one of said entities;

[0086] means of transmitting said first and second determined parametersfrom at least one of said entities called the first entity, to anotherof said entities called the second entity; and

[0087] means by which at least said second entity determines thevariations between the number of output symbols from and the number ofinput symbols to said rate matching means starting from said first andsecond transmitted parameters, for each of said processing modules, suchthat the maximum rate obtained for said transport channel composite doesnot cause an overshoot of said maximum physical rate of said at leastone physical channel.

[0088] The invention will be better understood after reading thefollowing description which is given solely as an example and which isgiven with reference to the attached drawings including FIGS. 3 to 5which represent the different methods of calculating the variationsΔN_(k) according to the invention, and FIG. 6 represents a step in whichthe temporary variations are partially corrected.

[0089] The following description applies to the case of flexible servicepositions, unless specifically mentioned otherwise.

[0090] According to the invention, each coded transport channel i ischaracterized by two parameters RM_(i) and P_(i). The first parameterRM_(i) represents a rate matching attribute for coded transport channeli. This attribute is proportional to the Eb/I ratio expected inreception, in other words if several coded transport channels denoted 1,2, . . . , T, are considered with attributes denoted RM₁, RM₂, . . . ,RM_(T) respectively, then the expected Eb/I ratios for each codedtransport channel will be in the same proportions as the RM_(i)parameters. The second parameter P_(i) is a coefficient corresponding tothe maximum allowable puncturing ratio for a given coded transportchannel i. Thus, a maximum puncturing ratio denoted P₁, P₂, . . . ,P_(T) is associated with each coded transport channel 1, 2, . . . , T.The maximum puncturing ratio is imposed by the channel coding used inthe processing system specific to the coded transport channelconsidered. Puncturing consists of eliminating coded symbols. Thiselimination is tolerable since channel encoding introduces a redundancy.However, the number of punctured symbols cannot be too large comparedwith the total number of coded symbols, therefore there is a maximumpuncturing ratio that depends on the channel coding and the decoder usedin reception.

[0091] Furthermore, note that the maximum physical rate N_(data) is themaximum number of symbols that can be transmitted in a multiplexingframe, allowing for the allocation of one or several physical channelsDPDCH.

[0092] According to the invention, only the set of parameters {RM₁}where i ε [1, T], and N_(data) are transmitted on a logical controlchannel associated with a previously existing coded transport channelcomposite, in order to enable each telecommunication system entity toknow the set of correspondences between the numbers of symbols afterrate matching N+ΔN and the numbers of symbols before rate matching N,for each coded transport channel. A logical channel denotes a channelthat can connect two level 3 layer protocols, typically two RadioResource Control (RRC) protocols. This type of logical channel iscarried by one of the transport channels within a previously existingcoded transport channel composite.

[0093] These parameters {RM_(i)}_(iε[1, T]) and N_(data) may bedetermined by one of the entities, or they may be “negotiated” betweenseveral entities. Note that N_(data) is a positive non-null integer andthe {RM_(i)}_(iε[1, T]) parameters are also positive and non-null, andmay also typically be expressed simply as binary numbers.

[0094] At the end of the negotiation, the {RM_(i)}_(iε[1, T]) andN_(data) parameters come into force at a moment determined by thenegotiation to define the (N, ΔN) pairs for each coded transport channeland for each of their respective transport formats within a newtransport channel composite. Note that this new composite is the resultof the composite under formation before the instant at which the RM_(i)and N_(data) parameters came into force. This new composite typicallyreplaces the previously existing composite on which the negotiation tookplace. It is impossible to make any negotiation when there is nopreviously existing transport channel composite on the dedicatedphysical channels DPDCH in duplex at the time that a transport channelcomposite is set up. Under these conditions, the number of codedtransport channels T and the {RM_(i)}_(iε[1, T]) and N_(data) parametersof the new coded transport channel composite are either predefined forthe system, or are determined in a simplified negotiation for whichdedicated physical data channels do not have to exist in advance.Typically, this type of negotiation may take place on common physicalchannels such as the Physical Random Access CHannel (PRACH) for theuplink, and the Forward Access Channel (FACH) for the downlink. Thissimplified negotiation could also relate to a context including the{RM_(i)}_(iε[1, T]) and N_(data) information, this context having beenset up during a previous connection of dedicated physical data channels.

[0095] The RM_(i) parameters are such that the rate matching ratiosRF_(i) associated with the same coded transport channel are proportionalto the parameters, factored by a semi-static factor L independent of thecoded transport channel i. Therefore, we have:

∀i RF_(i)=L.RM_(i)  (5)

[0096] Furthermore, the following must be satisfied in order to respectthe constraint on the maximum puncturing ratio:

∀i RF _(i)≧1−P _(i)  (6)

[0097] Note that according to the invention, there is no need to knowthe value of each parameter P_(i) to calculate the set ofcorrespondences (N, ΔN). The system of equations (5) and (6) isequivalent to the system of equations (5), (7) and (8) with respect tothe factor L:

L≧LMIN  (7)

[0098] where $\begin{matrix}{{LMIN} = {\max\limits_{i}\quad \frac{1 - P_{i}}{{RM}_{i}}}} & (8)\end{matrix}$

[0099] Therefore, all that has to be known is LMIN or any otherproportional value determined using a factor dependent on known data,for example PL=LMIN. min RM_(i), to have the same information on allpossible values of the rate matching ratios {RF_(i)}. However, this isnot necessary. In fact, the factor L is maximized as a function ofN_(data) such that the number of inserted DTX symbols is minimum whenthe transport channel composite rate is maximum. Consequently, sinceN_(data) is sufficiently large so that equation (7) is satisfied whenthe L factor is at a maximum, there is no need to know the P_(i)parameters or any other parameter (for example LMIN) giving a puncturinglimit to determine the variations ΔN. All that is necessary is that themethod used to calculate the correspondences (N, ΔN) maximizes the Lfactor, in other words minimizes the number of inserted DTX symbols forthe maximum rate of the transport channel composite. However, this doesnot mean that the values of the P_(i), PL or LMIN parameters are notnegotiated. It simply means that all that is necessary to calculatecorrespondences (N, ΔN) according to the invention is to know the valueof the maximum physical rate N_(data) in addition to the value of theparameters {RM_(i)}.

[0100] Thus, if l is the index of a transport formats combination, andif the coded transport channel i is in transport format index j in thistransport formats combination (in other words j=TF_(i)(l)), then foreach coded block with index k in coded transport channel i with format j(in other words k ε CBS(i,j)), if N_(k)+ΔN_(k) is the number of symbolsbefore segmentation step 122, the segments will have not more than$\left\lceil \frac{N_{k} + {\Delta \quad N_{k}}}{F_{i}} \right\rceil$

[0101] symbols at the end of this step. The result is that whenconsidering all k type coded blocks, where k ε CBS(i,TF_(i)(l)) on thecoded transport channel i for the transport formats combination withindex l and all coded transport channels i ε {l, . . . , T}, it isdeduced that the total number of symbols D(l) in a multiplexing frame ofthe transport format combination, l is equal to not more than thefollowing sum: $\begin{matrix}{{D(l)} = {\sum\limits_{i = 1}^{i = T}{\sum\limits_{k \in {{CBS}{({i,{{TF}_{i}{(l)}}})}}}\left\lceil \frac{N_{k} + {\Delta \quad N_{k}}}{F_{i}} \right\rceil}}} & (9)\end{matrix}$

[0102] Furthermore, given the rate limits of the dedicated physical datachannels, we have:

∀ l ε{1, . . . , C} D (l)≦N _(data)  (10)

[0103] Note that N_(data)−D(l) is the number of DTX symbols insertedduring step 132 for the transport formats combination l.

[0104] Since it is required to minimize the number of DTX symbolsinserted during step 132 when the transport channel composite rate ismaximum, we need:

max D(l)≈N _(data)

1≦l≦C  (11)

[0105] Also, according to the invention, the calculation of thevariation ΔN_(k) for any value of k includes mainly three phases. In thefirst phase, temporary variations denoted ΔN_(k) ^(temp) are calculatedso as to satisfy equation (11). In the second phase, these temporaryvariations are corrected by a “global” correction step in order tosatisfy the relation (10), and in the third phase the final variationsare generated by assigning the most recent temporary variations obtainedto them. These three phases are illustrated in FIGS. 3, 4 and 5 whichshow three different methods of calculating the variations ΔN_(k).Identical steps are referenced by the same number in each of thesefigures.

PHASE 1 Calculation of Temporary Variations

[0106] Note that N_(k)+ΔN_(k)≈RF_(i). N_(k) is true for all values of kε CBS(i,j). According to equation (5), we can then write:$\begin{matrix}{{D(l)} \approx {L \cdot {\sum\limits_{i = 1}^{i = T}{\sum\limits_{k \in {{CBS}{({i,{{TF}_{i}{(l)}}})}}}\frac{{RM}_{i} \cdot N_{k}}{F_{i}}}}}} & (12)\end{matrix}$

[0107] The member at the right of this equation is a rate estimator ofthe composite CCTrCH for the transport formats combination l. Thisequation (12) can then be used to find an approximate value of thefactor L maximized under the constraint represented by equation (10) tosatisfy equation (11). According to a first embodiment illustrated inFIG. 3, this value is given by the following equation: $\begin{matrix}{L = \frac{N_{data}}{\max\limits_{1 \leq l \leq C}{\sum\limits_{i = 1}^{i = T}{\sum\limits_{k \in {{CBS}{({i,{{TF}_{i}{(l)}}})}}}\frac{{RM}_{i} \cdot N_{k}}{F_{i}}}}}} & (13)\end{matrix}$

[0108] Note that the denominator in the member at the right of equation(13) is the maximum value of the rate estimator of the composite CCTrCHfor the transport format combinations and calculated assuming L=1 (whichis equivalent to assume fictitiously that RF₁=RM_(i)).

[0109] This calculation step is denoted 301 in FIG. 3. Note thattransmission of the N_(data) parameter is referenced 300A in FIG. 3.Similarly, the transmission of parameters {RM_(i)}_(l≦i≦T) and thetransmission of the numbers of symbols {N_(k)}_(kεCBS(i,TF) _(i) _((l)))are denoted 300B and 300C respectively.

[0110] We then determine the values of the various rate matching ratiosRF_(i), making use of equations (5) and (13), in a step 302.

[0111] The temporary variation ΔN_(k) ^(temp) for each type k is thendetermined in a step 303, for example using the following equation:$\begin{matrix}\left\{ {{\begin{matrix}{\forall{i \in \left\{ {1,\ldots \quad,T} \right\}}} \\{\forall{j \in {{TFS}(i)}}} \\{\forall{k \in {{CBS}\left( {i,j} \right)}}}\end{matrix}\quad \Delta \quad N_{k}^{temp}} = {\left\lceil {{RF}_{i} \cdot N_{k}} \right\rceil - N_{k}}} \right. & (14)\end{matrix}$

[0112] As a variant, equation (14) could be replaced by equation (14bis)given below. This equation has the advantage that the number of symbolsafter rate matching N_(k)+ΔN_(k) provided (assuming ΔN_(k)=ΔN_(k)^(temp)) at the beginning of the segmentation step 122 (FIG. 1) is amultiple of the number F_(i) of segments to be produced. Thus, allsegments originating from the same block have the same number ofsymbols, which simplifies the receiver since the number of symbols doesnot vary during the TTI interval. $\begin{matrix}\left\{ {{\begin{matrix}{\forall{i \in \left\{ {1,\ldots \quad,T} \right\}}} \\{\forall{j \in {{TFS}(i)}}} \\{\forall{k \in {{CBS}\left( {i,j} \right)}}}\end{matrix}\quad \Delta \quad N_{k}^{temp}} = {{F_{i}\left\lceil \frac{{RF}_{i} \cdot N_{k}}{F_{i}} \right\rceil} - N_{k}}} \right. & \text{(14bis)}\end{matrix}$

[0113] As a variant, it would be possible to use a rounding functionother than the x

┌x┐ function in equation (14) or (14bis). For example, it would bepossible to use the x

└x┘ function, where └x┘ is the largest integer less than or equal to x.

[0114] It would also be possible to consider calculating the factor Land the rate matching ratio RF_(i) by making approximations, for exampleby expressing L and/or RF_(i) as a fixed decimal number with a limitednumber of digits after the decimal point. This embodiment is illustratedin FIG. 4.

[0115] Thus as a variant, the factor L is calculated using the followingequation, in a step 401: $\begin{matrix}{L = {\frac{1}{LBASE} \cdot \left\lfloor \frac{{LBASE} \cdot N_{data}}{\max\limits_{1 \leq l \leq C}{\sum\limits_{i = 1}^{i = T}{\sum\limits_{k \in {{CBS}{({i,{{TF}_{1}{(l)}}})}}}\frac{{RM}_{i} \cdot N_{k}}{F_{i}}}}} \right\rfloor}} & \text{(13bis)}\end{matrix}$

[0116] where LBASE is an integer constant, for example a power of 2 suchas 2^(n), where n is the number of bits in the L factor after thedecimal point.

[0117] The rate matching ratios RF_(i) are then calculated in a nextstep 402 using the following equation: $\begin{matrix}{{\forall{i\quad {RF}_{i}}} = {\frac{1}{RFBASE} \cdot \left\lfloor {{RFBASE} \cdot L \cdot {RM}_{i}} \right\rfloor}} & \text{(5bis)}\end{matrix}$

[0118] where RFBASE is an integer constant, for example a power of 2such as 2^(n), where n is the number of bits after the decimal point inRF_(i).

[0119] In the same way as for equations (5) and (14), the x

└x┘ function in equations (5bis) and (14bis) can be replaced by anyother rounding function.

[0120] According to a third embodiment illustrated in FIG. 5, theexpression of the factor L is modified by using a coefficient thatdepends on known data (for example {RM_(i)} or N_(data)), in thenumerator and in the denominator. This could have an impact on thecalculated values to the extent that the expression of the factor L usesan approximation. For example, the following equation could be used:$\begin{matrix}{L = {\frac{1}{{LBASE} \cdot \left( {\min\limits_{1 \leq i \leq T}{RM}_{i}} \right)} \cdot \left\lfloor \frac{{LBASE} \cdot \left( {\min\limits_{1 \leq i \leq T}{RM}_{i}} \right) \cdot N_{data}}{\max\limits_{1 \leq l \leq C}{\sum\limits_{i = 1}^{T}{\sum\limits_{k \in {{CBS}{({i,{{TF}_{i}{(l)}}})}}}\frac{{RM}_{i} \cdot N_{k}}{F_{i}}}}} \right\rfloor}} & \text{(13ter)}\end{matrix}$

[0121] The rate matching ratios RF_(i) are then calculated usingequation (5) or (5bis).

[0122] In summary, the phase in which the temporary variations ΔN_(k)^(temp) are calculated comprises the following steps:

[0123] 1. Calculate the factor L as a function of the maximum physicalrate N_(data) and the RM_(i) parameters (step 301, 401 or 501).

[0124] 2. Calculate the rate matching ratio RF_(i) for each codedtransport channel i, as a function of the RM_(i) parameters and thefactor L (step 302, 402 or 502).

[0125] 3. For each k type coded block in a coded transport channel i,calculate the temporary variation ΔN_(k) ^(temp) as a function of thenumber of symbols N_(k) before rate matching and the rate matching ratioRF_(i) (step 303).

PHASE 2 Global Correction of Temporary Variations

[0126] In this second phase, an iterative check is carried out to verifythat the number of symbols D^(temp) (l) per multiplexing frame for theCCTrCH composite is less than or equal to the maximum physical rateN_(data), for each transport format combination with index l, whereD^(temp) (l) is determined using current values of temporary variationsΔN_(k) ^(temp), in other words initially with variations determinedduring the first phase and then with the most recent temporaryvariations calculated during the second phase. If necessary, the valueof the temporary variations ΔN_(k) ^(temp) is corrected. This step isalso called the global temporary variations correction step for alltransport format combinations l. This step is marked as reference 308 inFIGS. 3, 4 and 5.

[0127] If equation (9) is rewritten with temporary variations ΔN_(k)^(temp), the following expression of the temporary rate D^(temp)(l) ofthe composite is obtained: $\begin{matrix}{{D^{temp}(l)} = {\sum\limits_{i = 1}^{T}{\sum\limits_{k \in {{CBS}{({i,{{TF}_{i}{(l)}}})}}}\left\lceil \frac{N_{k} + {\Delta \quad N_{k}^{temp}}}{F_{i}} \right\rceil}}} & \text{(9bis)}\end{matrix}$

[0128] This calculation is carried out in step 304 in FIGS. 3, 4 and 5.As described previously, this second phase implies thatD^(temp)(l)≦N_(data), for each transport format combination with indexl.

[0129] Every time that a transport format combination l is detected suchthat D^(temp)(l)>N_(data), then the values of some temporary variationsΔN_(k) ^(temp) are corrected by a “partial correction” step. Thus, thevalues of some temporary variations ΔN_(k) ^(temp) are reduced in thisstep so that the temporary rate D^(temp)(l) of the composite is lessthan the maximum physical rate N_(data) after correction.

[0130] Considering that the temporary rate D^(temp)(l) of the compositeis an increasing function that depends on temporary variations ΔN_(k)^(temp), a partial correction applied to the transport formatcombination with index l does not change the result of verificationsalready made for previous transport format combinations. Therefore,there is no point of rechecking that D^(temp)(l)≦N_(data) for previouslyverified combinations.

[0131] The second phase is summarized by the following algorithm:

[0132] for all values of l from 1 to C, do

[0133] if D^(temp)(l)≦N_(data) then

[0134] partial correction of ΔN_(k) ^(temp) values

[0135] end if

[0136] end do.

[0137] The step in which the maximum physical rate N_(data) is comparedwith the temporary rate D^(temp)(l) of the composite and the step inwhich temporary variations ΔN_(k) ^(temp) are partially corrected, aredenoted 305 and 306 respectively in FIGS. 3, 4 and 5. The finalvariations ΔN_(k) are the temporary variations ΔN_(k) ^(temp) obtainedat the end of the second phase. This assignment step forms the thirdphase.

[0138] We will now describe the partial correction step of the temporaryvariations ΔN_(k) ^(temp) mentioned in line 3 of the previous algorithm.In the remainder of the description of the partial correction, allnotation used is applicable for a current index l of the transportformat combination. l is not always given in the new expressions, inorder to simplify the notation.

[0139] Remember that MBS(l) is the set of coded block indexes for thetransport format combination l. In other words, we have:${{MSB}(l)} = {\bigcup\limits_{1 \leq i \leq T}{{CBS}\quad \left( {i,{{TF}_{i}(l)}} \right)}}$

[0140] Let U be the number of elements of MBS(l). Since MBS(l) is a setof integer numbers, it is ordered into the canonical order of integernumbers. Therefore, it is possible to define a strictly increasingmonotonic bijection K from {1, . . . , U} to MBS(l). We then have:

MBS(l)={K(1), K(2), . . . . , K(U)}

[0141] where

K(1)<K(2)<. . . <K(U)

[0142] Note that any other ordering rule can be used as a variant, forexample another bijection of {1, . . . , U} to MBS(l). (K(1), . . . ,K(U)) defines an ordered list. Similarly, for every coded block withindex k in MBS(l), there is a single coded transport channel i producingthis coded block for the transport format combination with index l suchthat k ε CBS(i,TF_(i)(l)). Therefore, it is possible to univocallydefine an application I from {1, . . . , U} to {1, . . . , T}, whichidentifies the single transport channel with index i=I(x) such that k εCBS(i,TF_(i)(l)) for each coded block with index k=K(x).

[0143] Thus, a partial sum S_(m) can be defined for all values of m ε{1, . . . , U}, for m equal to U, a total sum S_(U), and an coefficientZ_(m) increasing as a function of m such that: $\begin{matrix}{S_{m} = {\sum\limits_{x = 1}^{x = m}{{RM}_{I{(x)}} \cdot \frac{N_{K{(x)}}}{F_{I{(x)}}}}}} & (16) \\{Z_{m} = \left\lfloor {\frac{S_{m}}{S_{U}} \cdot N_{data}} \right\rfloor} & (17)\end{matrix}$

[0144] Note that, like for any coded transport channel i, 8 is amultiple of the duration F_(i) expressed as a number of multiplexingframes in the TTI interval in the coded transport channel i, then thepartial sum S_(m) can be coded without approximation as a fixed decimalnumber with 3 bits after the decimal point.

[0145] As a variant, the x

└x┘ rounding function in equation (17) may be replaced by any otherincreasing monotonic rounding function.

[0146] Assuming Z₀=0, new variations called the intermediate variationsΔN_(k) ^(new) can then be defined and can replace the temporaryvariations ΔN_(k) ^(temp) used for the transport format combination l.These intermediate variations ΔN_(K(x)) ^(new) are given by thefollowing equation:

∀ x ε {1, . . . , U} ΔN _(K(x)) ^(new)=(Z _(x) −Z _(x−l).) F _(l(x)) −N_(K(x))  (18)

[0147] In summary, temporary variations ΔN_(k) ^(temp) are partiallycorrected using the following algorithm:

[0148] for all x from 1 to U, do

[0149] if ΔN_(k(−x)) ^(temp)>ΔN_(K(x)) ^(new) then

[0150] ΔN_(K(x)) ^(temp)←ΔN_(K(x)) ^(new)

[0151] end if

[0152] end do.

[0153] Note that the ← symbol in the third line of the algorithm meansthat the value of ΔN_(K(x)) ^(temp) is changed, and that it is replacedby the value of ΔN_(K(x)) ^(new).

[0154] This partial correction step is illustrated in FIG. 6. In a firststep 601, the intermediate variation ΔN_(K(x)) ^(new) is calculated andis then compared with the value of the corresponding temporary variationΔN_(K(x)) ^(temp) in a step 602. If ΔN_(K(x)) ^(temp)>ΔN_(K(x)) ^(new),the value of the intermediate variation ΔN_(K(x)) ^(temp) is assigned tothe temporary variation ΔN_(K(x)) ^(temp) in a step 603, and then thenext step 604 is executed. If ΔN_(K(x)) ^(temp)<ΔN_(K(x)) ^(new), thenext step 604 is executed directly. In this step 604, it is checkedwhether x is equal to the value U. If it is not, x is incremented in astep 605, and then step 601 is carried out again with this new value ofx. If x is equal to U, the partial correction step is terminated.

PHASE 3 Determination of Final Variations

[0155] Remember that during this third phase, the value of the finalvariations ΔN_(k) are the values of the temporary variations ΔN_(k)^(temp) originating from the second phase. This phase corresponds tostep 307 in FIGS. 3, 4 and 5. Consequently, the value of the final rateD(l) of the composite is equal to the value given by equation (9), for agiven transport formats combination l.

[0156] In order to enable blind rate detection, a “fixed servicepositions” technique comprises the step in which DTX symbols areinserted in step 116 such that the rate (including DTX symbols) at theend of this step 116 is constant.

[0157] Consequently, all steps following encoding of the channel arecarried out independently of the current rate. Thus in reception,demultiplexing, de-interleaving steps, etc., can be carried out inadvance without knowing the current rate. The current rate is thendetected by the channel decoder (performing the reverse of the operationdone by the channel encoder 108).

[0158] In order for the step inverse to step 118 of rate matching to beindependent of the current rate, the puncturing pattern or repetitionpattern should be independent of the rate, in other words the number ofcoded blocks and the numbers of symbols N in each.

[0159] Thus firstly, in the case of fixed service positions there isnever more than one coded block per TTI interval, and in fact it isconsidered that there is always one if it is assumed that the lack of acoded block is equivalent to the presence of a coded block without asymbol. Consequently, the number of blocks does not vary as a functionof the rate.

[0160] The optimum puncturing/repetition pattern depends on the N and ΔNparameters giving the number of symbols before rate matching and thevariation due to rate matching, respectively. Therefore, these twoparameters need to be constant to obtain a pattern independent of therate, in other words the rate matching step 118 should be placed afterstep 122 in which DTX symbols are inserted. However, since all DTXsymbols are identical, puncturing them or repeating them atpredetermined positions induces unnecessary complexity (the same resultcan be achieved by puncturing or repeating the last DTX symbols in theblock, and this is easier to implement). Therefore, it was decided thatthe rate matching step 118 and the DTX symbol insertion step 122 wouldbe carried out in this order as shown in FIG. 1, but that therepetition/puncturing pattern would be determined only for the case inwhich the composite is at its maximum rate. The pattern thus obtained istruncated for lower rates.

[0161] Note that in prior art, the fixed service positions and flexibleservice positions are two mutually exclusive techniques. In theinvention, it is possible to have some transport channels in fixedservice positions, and other channels in flexible service positions.This makes it possible to carry out blind rate detection only fortransport channels in fixed service positions, and a rate detectionusing an explicit rate information for the other transport channels.Thus, the explicit rate information, TFCI, only indicates currenttransport formats for transport channels in flexible service positions.The result is that a lower capacity is necessary for TCFI transmission.

[0162] In the case of combined fixed and flexible service positions,some composite transport channels are in fixed service positions andothers are in flexible service positions. Step 116 in which DTX symbolsare inserted is only present for coded transport channels in fixedservice positions, and it is missing for other transport channels thatare in flexible service positions. Furthermore, the DTX symbol insertionstep 132 is present if there is at least one coded transport channel infixed service positions, and otherwise it is missing.

[0163] During reception of a multiplexing frame and the associated TFCI,the receiver may implement all steps inverse to those following thechannel encoding. The TFCI information gives it the encoding format ofcoded transport channels in flexible service positions, and fortransport channels in fixed service positions, the receiver acts as ifthey were in the highest rate transport format.

[0164] In the invention, the repetition/puncturing pattern depends onthe two parameters N and ΔN, regardless of whether the coded transportchannel is in the fixed service positions or flexible service positions,however in the flexible service position N and ΔN correspond to thenumber of symbols before rate matching and to the variation of thisnumber during the rate matching step 118 respectively, while in fixedservice positions they are only two “fictitious” parameters used todetermine the puncturing pattern when the coded transport channel rateis not maximum. In other words, these two parameters correspond to thesize of the block for which the rate is to be matched, and its variationafter rate matching when the rate of the coded transport channel ismaximum.

[0165] When the rate of the coded transport channel is not maximum, thepuncturing/repetition pattern is truncated. This pattern is actually alist of symbol positions that are to be punctured/repeated. Truncatingconsists of considering only the first elements in this list, which arereal positions in the block for which the rate is to be matched.

[0166] Thus according to the invention, when there is at least one codedchannel in the fixed service positions, rate matching parameters aredetermined in the same way as when all coded transport channels are inthe flexible service positions, except that coded transport channels infixed service positions are considered fictitiously to be at theirmaximum rate.

[0167] Consider the example in FIG. 2, and assume that coded transportchannel D is in the fixed service position, whereas transport channelsA, B and C are in flexible service positions. The table below shows thelist of transport format combinations for this example. exampleTransport format for transport frame with Combination channels thisindex A B C D combination  0 0 2 0 0 11  1 0 2 0 2 10  2 0 3 0 0 12  3 03 0 1 13  4 0 2 2 1  8  5 2 0 2 1  0  6 0 2 2 2  9  7 2 1 1 0  5  8 2 02 2 1 and 2  9 0 3 2 1 14 and 15 10 2 1 1 1  4 11 2 0 2 3  3 12 2 1 2 16 and 7

[0168] The rate matching configuration parameters are calculated in thesame way as for flexible service positions, except that it includes theadditional prior step of fictitiously replacing the column in this tablecorresponding to coded transport channel D, by setting all elements tothe transport format for the highest rate, in other words the transportformat with index 3. This gives the following “fictitious” table inwhich the boxes that have been modified and which correspond to“fictitious” transport formats are shown in grey: Example Transportformat for transport frame with Combination channels this index A B C Dcombination  0 0 2 0 3 11  1 0 2 0 3 10  2 0 3 0 3 12  3 0 3 0 3 13  4 02 2 3  8  5 2 0 2 3  0  6 0 2 2 3  9  7 2 1 1 3  5  8 2 0 2 3 1 and 2  90 3 2 3 14 and 15 10 2 1 1 3  4 11 2 0 2 3  3 12 2 1 2 3 6 and 7

[0169] By definition, coded transport channels i in the fixed servicespositions, have not more than one coded block per TTI interval (∀ j εTFS(i) CBS(i,j) has not more than one element).

[0170] Furthermore, in the invention it is assumed that coded blocksizes are indexed such that the absence of a coded block for codedtransport channels in fixed service positions leads to indexing with theconvention that the absence of a block is equivalent to the presence ofa zero size block (i.e. an index k is assigned with N_(k)=0, andtherefore ∀ j ε TFS(i) CBS(i,j) has at least one element).

[0171] With the previous assumptions, the first phase in the calculationof the temporary variations ΔN_(k) ^(temp), which has already beendescribed, must be preceded by the following step when there is at leastone coded transport channel in the fixed service positions.

[0172] For all i from 1 to T do

[0173] if the coded transport channel with index i is

[0174] in the fixed service positions then

[0175] for all values of j in TFS(i), do let k be the single element ofCBS(I,j)$\left. N_{k}\leftarrow{\underset{k^{\prime} \in {{CBS}{({i,j^{\prime}})}}}{\max\limits_{j^{\prime} \in {{TFS}{(i)}}}}N_{k^{\prime}}} \right.$

[0176] end do

[0177] end if

[0178] end do

[0179] The fifth instruction means that the coded transport channel i isfictitiously considered to be at its maximum rate; its actual rate(N_(k)) is replaced (←) by its maximum rate$\left( {\underset{k^{\prime} \in {{CBS}{({i,j^{\prime}})}}}{\max\limits_{j^{\prime} \in {{TFS}{(i)}}}}N_{k^{\prime}}} \right).$

1. Method for configuring a telecommunication system comprising at leastone sending entity and at least one receiving entity, said sending andreceiving entities implementing a step for transmission of datatransported on at least one physical channel (DPDCH), said at least onephysical channel (DPDCH) transmitting a transport channel composite(CCTrCH) under formation and having its own maximum physical rate(N_(data)) offered by said at least one physical channel (DPDCH), saidtransport channel composite (CCTrCH) comprising at least two transportchannels (1 to T), said data transmission step being preceded by a dataprocessing procedure for each of said transport channels (1 to T), saiddata processing procedure comprising at least one rate matching step,said rate matching step transforming a number of symbols (N_(k)) beforesaid rate matching step into a number of symbols (N_(k)+ΔN_(k)) aftersaid rate matching step, said number of symbols (N_(k)+ΔN_(k)) aftersaid rate matching step being obtained approximately by multiplying saidnumber of symbols (N_(k)) before said rate matching step by a ratematching ratio (RF_(i)) specific to each of said at least two transportchannels (i), said composite (CCTrCH) of transport channels (1 to T)having a number of symbols (D(1)) approximately equal to the algebraicsum of the numbers of symbols ((N_(k)+ΔN_(k))/F_(i)) in the transportchannels after the corresponding rate matching steps in said processingprocedures for a period common to said processing procedures,characterized in that it comprises the following successive steps: astep for determining from at least one of said entities, for each ofsaid processing procedures, a first parameter (RM_(i)) related to therate matching, said first parameter being proportional to said ratematching ratio (RF_(i)), and for all said processing procedures, asecond parameter representing said maximum physical rate (N_(data)); atransmission step for said first (RM_(i)) and second (N_(data))parameters determined from at least one of said entities, called thefirst entity, to another of said entities, called the second entity; anda step in which at least said second entity determines the variation(ΔN_(k)) between the number of symbols (N_(k)+ΔN_(k)) after said ratematching step and the number of symbols (N_(k)) before said ratematching step, for each of said processing procedures, starting from oneof said first (RM_(i)) and second (N_(data)) transmitted parameters, sothat the maximum rate of said composite (CCTrCH) of the transportchannels (1 to T) obtained does not cause an overshoot of said maximumphysical rate(N_(data)) of said at least one physical channel (DPDCH).2. Method according to claim 1, characterized in that said secondparameter is said maximum physical rate (N_(data)) of said at least onephysical channel (DPDCH).
 3. Method according to claim 1 or 2,characterized in that the variation (ΔN_(k)) between the number ofsymbols (N_(k)+ΔN_(k)) after said rate matching step and the number ofsymbols (N_(k)) before said rate matching step is determined such thatthe maximum transport channel composite rate is approximately equal tothe maximum physical rate (N_(data)) of said at least one physicalchannel (DPDCH).
 4. Method according to any of claims 1 to 3,characterized in that it is implemented within a telecommunicationsystem using a CDMA type multiple access technology.
 5. Method accordingto any of claims 1 to 4, characterized in that the telecommunicationsystem comprises a sending entity comprising at least one base stationand a receiving entity comprising at least one mobile station.
 6. Methodaccording to claim 5, characterized in that the first (RM_(i)) andsecond (N_(data)) parameters are transmitted on at least one logicalcontrol channel associated with at least one transport channel of acomposite (CCtrCH) of previously existing transport channels.
 7. Methodaccording to any of claims 1 to 6, characterized in that a step fornegotiating between said at least one sending entity and said at leastone receiving entity said first (RM_(i)) and second (N_(data))parameters is substituted for said determination step from at least oneof said entities of said first (RM_(i)) and second (N_(data))parameters.
 8. Method according to claim 7, characterized in that thenegotiation step is implemented on at least one common physical channelbelonging to the group comprising: a physical random access channel(PRACH) on the uplink; a forward access channel (FACH) on the downlink.9. Method according to any of claims 1 to 8, characterized in that eachof said rate matching steps is preceded by a channel encoding step. 10.Method according to any of claims 1 to 9, characterized in that at leastone transport format (j) being defined for each transport channel, atleast one transport format combination (1) determining a transportformat among said defined transport formats for each of said transportchannels, each transport channel comprising at least one data block type(k), said type (k) depending at least on said transport channel (i) anda transport format (j) of the transport channel concerned, each datablock type (k) defining a number of symbols (N_(k)) of said data blockbefore said rate matching step, said step in determining the variation(ΔN_(k)) between the number of symbols (N_(k)) before said rate matchingstep and the number of symbols after said rate matching step(N_(k)+ΔN_(k)) comprises at least some of the following steps: a step(301,302,303; 401,402,403; 501,502,503) in which a temporary variation(ΔN_(k) ^(temp)) is calculated for each of said data block types (k)starting from said first (RM_(i)) and second (N_(data)) parameters andsaid number of symbols (N_(k)) before said rate matching step; a step(308) to correct the set of said transport format combinations of saidtemporary variations, so that a temporary rate for the composite(CCTrCH) resulting from said temporary variations does not cause anovershoot of said maximum physical rate (N_(data)) for the set of saidtransport format combinations, said correction step being called theglobal correction step; a step (307) in which the final variations(ΔN_(k)) are determined.
 11. Method according to claim 10, characterizedin that said calculation step comprises the following for each of saidat least two transport channels (i): a first step (302;402;502) tocalculate the rate matching ratio (RF_(i)) of the transport channel (i)concerned as a function of said first (RM_(i)) and second (N_(data))parameters and said number of symbols (N_(k)) before said rate matchingstep; a second step (303;403;503) to calculate temporary variations(ΔN_(k) ^(temp)) for each of said types (k) of data blocks depending onsaid transport channel concerned, said second calculation step dependingon said rate matching ratio (RF_(i)) and said number of symbols (N_(k))before said rate matching step, so that said rate matching ratio(RF_(i)) is approximately equal to the ratio between firstly the numberof symbols (N_(k)+ΔN_(k) ^(temp)) after said rate matching step andsecondly the number of symbols (N_(k)) before said rate matching step.12. Method according to any of claims 10 and 11, characterized in thatsaid global correction step comprises the following steps iterativelyfor each (l) of said transport format combinations: a step (304) inwhich a temporary rate (D^(temp)(l)) of the transport channel composite(CCTrCH) is calculated as a function of said temporary variations(ΔN_(k) ^(temp)) and said number of symbols (N_(k)) before said ratematching step, for the transport format combination concerned (l); astep (305) in which said calculated temporary rate (D^(temp)(l)) iscompared with said maximum physical rate (N_(data)) for the transportformat combination (l) concerned; if the temporary rate (D^(temp)(l)) ofthe transport channel composite (CCTrCH) results in an overshoot of saidmaximum physical rate (N_(data)), a correction step (306) is carried outto correct at least some of said temporary variations (ΔN_(k) ^(temp)),said correction step being called a partial correction step.
 13. Methodaccording to claim 12, characterized in that said step (304) calculatinga temporary rate (D^(temp)(l)) of the transport channel composite isgiven by the following formula:${D^{temp}(l)} = {\sum\limits_{i = l}^{i = T}{\sum\limits_{k \in {{CBS}{({i,{{TF}_{i}{(l)}}})}}}\left\lceil \frac{N_{k} + {\Delta \quad N_{k}^{temp}}}{F_{i}} \right\rceil}}$

where D^(temp)(l) is the temporary composite rate for transport formatcombination l; CBS(i,j) is the set of indexes of data blocks fortransport channel i for transport format j; TF_(i)(l) is the transportformat for transport channel i in the transport format combination l; Tis the number of transport channels in the composite; N_(k) is thenumber of symbols in the data block type k; ΔN_(k) ^(temp) is thetemporary variation in data block type k; and F_(i) is a factor specificto transport channel i.
 14. Method according to claim 12 or 13,characterized in that said partial correction step (306) comprises: astep in which an ordered list (K(1) . . . K(U)) of a set of data blocktypes (k) is created, said set being defined so that, for each transportchannel, an element of said set is a function of the transport channeland the transport format determined for said transport channel by thetransport format combination concerned; for each element in said list, astep in which a coefficient (Z_(x)) is calculated that increases as afunction of the order of said list; for each element of said list, astep in which an intermediate variation (ΔN_(κ(x)) ^(new)) is calculatedas a function of the difference between firstly said increasingcoefficient (Z_(x)) and secondly its predecessor (Z_(x−1)) if there isone, or otherwise is equal to a null value; for each element in saidlist, a step in which a corrected temporary variation is determined. 15.Method according to claim 14, characterized in that said increasingcoefficient (Z_(x)) is approximately equal to the product of the maximumphysical rate (N_(data)) by a factor representing the ratio between apartial sum (S_(m)) and a total sum (S_(U)), the summation being made inthe order of said list.
 16. Method according to claim 15, characterizedin that the generic term of said partial and total sums is proportionalto: said first parameter (RM_(I(x))) of the transport channel concerned(I(X)) corresponding to element (K(X)) of said list for which thesummation is made; said number of symbols (N_(K(x))) defined by the type(K(x)) of data blocks corresponding to the element of said list forwhich the summation is made.
 17. Method according to claim 16, eachtransport channel being transmitted on at least one transmission timeinterval (TTI) with a duration specific to the transport channel (i)concerned, characterized in that said common period corresponding to theduration of a multiplexing frame, said step in which intermediatevariations are calculated (ΔN_(K(x)) ^(new)) is given by the followingformula ∀ x ε {1, . . . , U} ΔN _(K(x)) ^(new)=(Z _(x) −Z _(x−l)).F_(I(x)) −N _(K(x)) where ΔN_(K(x)) ^(new) is an intermediate difference,N_(K(x)) is the number of symbols defined by the type K(x) of datablocks; Z_(x) is the increasing coefficient; and F_(I(x)) is theduration of said transmission time interval as a number of multiplexingframes.
 18. Method according to any of claims 14 to 17, characterized inthat said step to determine the corrected temporary variation (ΔN_(κ(x))^(temp)) is carried out assuming that the calculated intermediatevariation (ΔN_(K(x )) ^(new)) is less (602) than the temporary variation(ΔN_(k(x)) ^(temp)) corresponding to the element in said list concerned,and in that said determination step consists of assigning (603) thecalculated intermediate variation (ΔN_(k(x)) ^(new)) to the temporaryvariation (ΔN_(k(x)) ^(temp)).
 19. Method according to claim 10,characterized in that said step (307) in which the final variations aredetermined consists of assigning the last temporary variations to saidfinal variations.
 20. Method according to claim 11, characterized inthat, during said step (302;402;502) to calculate the rate matchingratio (RF_(i)), said calculated rate matching ratio (RF_(i)) isapproximately equal to the product of firstly said first parameter(RM_(i)) for the transport channel concerned (i) and secondly a factor(L) representing a ratio between said maximum physical rate (N_(data))and an estimator of the maximum composite rate (CCTrCH), said estimatorbeing calculated assuming that each of said rate matching ratios isrespectively equal to said first parameter (RM_(i)) as a function of thetransport channel (i) concerned.
 21. Configuration apparatus of the typecomprising at least means of transmitting data transported on at leastone physical channel (DPDCH), said at least one physical channel (DPDCH)transmitting a transport channel composite (CCTrCH) under formation andhaving its own maximum physical rate (N_(data)) offered by said at leastone physical channel (DPDCH), said transport channel composite (CCTrCH)comprising at least two transport channels, said apparatus comprising adata processing module comprising at least rate matching means for eachof said transport channels, said rate matching means transforming anumber (N_(k)) of input symbols in said rate matching means into anumber (N_(k)+ΔN_(k)) of output symbols of said rate matching meansobtained approximately by multiplying said number (N_(k)) of inputsymbols by a rate matching ratio (RF_(i)) specific to said at least onetransport channel (i) concerned, said transport channel composite(CCTrCH) having a number of symbols (D(l)) approximately equal to thealgebraic sum of the numbers of transport channel symbols originatingfrom the corresponding rate matching means in said processing modules (1to T) for a period common to said processings, characterized in that itcomprises: means of determining a first parameter (RM_(i)) related tothe rate matching, said first parameter being proportional to said ratematching ratio (RF_(i)) for each of said processing modules (1 to T),and a second parameter (N_(data)) representative of said maximumphysical rate (N_(data)), for the all said processing modules (1 to T),from at least one of said entities; means of transmitting said first(RM_(i)) and second (N_(data)) parameters determined from at least oneof said entities called the first entity, to another of said entitiescalled the second entity; and means by which at least said second entitydetermines the variation (ΔN_(k)) between the number of output symbolsfrom and the number of input symbols (ΔN_(k)) to said rate matchingmeans starting from said first (RM_(i)) and second (N_(data))transmitted parameters, for each of said processing modules (1 to T), sothat the maximum rate obtained for the composite (CCTrCH) of saidtransport channels (1 to T) does not cause an overshoot of said maximumphysical rate (N_(data)) of said at least one physical channel (DPDCH).22. Base station of a telecommunication system, characterized in that itcomprises an apparatus according to claim
 21. 23. Mobile station of atelecommunication system characterized in that it comprises an apparatusaccording to claim 21.